Domain proposal: Sentence generation with tree-adjoining grammars (CRISP)
نویسندگان
چکیده
Overview The CRISP domain is motivated by the problem of sentence generation in natural language generation (NLG).1 NLG is a major subfield of natural language processing, concerned with computing natural language sentences or texts that convey a given piece of information to an audience. In the sentence generation task, we focus on generating a single sentence that expresses a given meaning according to a given grammar. As a planning task, a plan encodes the necessary sentence with the actions in the plan corresponding to the utterance of individual words arising from a syntactically correct (and semantically appropriate) grammatical derivation (Koller and Stone 2007).
منابع مشابه
Feature Unification in TAG Derivation Trees
The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from feature based tree adjoining grammars into this new formalism. The translation preserves the derivation structures of the original grammar, and accounts for feat...
متن کاملUsing regular tree grammars to enhance sentence realisation
Feature-based regular tree grammars (FRTG) can be used to generate the derivation trees of a featurebased tree adjoining grammar (FTAG). We make use of this fact to specify and implement both an FTAG-based sentence realiser and a benchmark generator for this realiser. We argue furthermore that the FRTG encoding enables us to improve on other proposals based on a grammar of TAG derivation trees ...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملSentence Generation as Planning with Probabilistic LTAG
We present PCRISP, a sentence generation system for probabilistic TAG grammars which performs sentence planning and surface realization in an integrated fashion, in the style of the SPUD system. PCRISP operates by converting the generation problem into a metric planning problem and solving it using an offthe-shelf planner. We evaluate PCRISP on the WSJ corpus and identify trade-offs between cov...
متن کاملA faster parsing algorithm for Lexicalized Tree-Adjoining Grammars
This paper points out some computational inefficiencies of standard TAG parsing algorithms when applied to LTAGs. We propose a novel algorithm with an asymptotic improvement, from to , where is the input length and are grammar constants that are independent of vocabulary size. Introduction Lexicalized Tree-Adjoining Grammars (LTAGs) were first introduced in (Schabes et al., 1988) as a variant o...
متن کامل